1399B - Gifts Fixing - CodeForces Solution

greedy *800

Please click on ads to support us..

Python Code: 

t = int(input())
for i in range(t):
	s = int(input())
	a = list(map(int,input().split()))
	b = list(map(int,input().split()))
	m, n, c = min(a),min(b),0
	for x in range(s):
		c += max(a[x]-m,b[x]-n)
	print(c)

C++ Code: 

#include <iostream>
using namespace std;

int mx(int a, int b)
{
    if(a>=b){
        return a;
    }
    else{
        return b;
    }
}

int main()
{
    int t;
    cin>>t;
    while(t--){
        int n;
        cin>>n;
        int a[n], b[n], i;
        for(i = 0; i<n; i++){
            cin>>a[i];
        }
        for(i = 0; i<n; i++){
            cin>>b[i];
        }

        int mna = a[0], mnb = b[0];
        for(i = 1; i<n; i++){
            if(a[i]<mna){
                mna = a[i];
            }
            if(b[i]<mnb){
                mnb = b[i];
            }
        }

        int x, y;
        long long cnt = 0;
        for(i = 0; i<n; i++){
            x = a[i]-mna;
            y = b[i]-mnb;
            cnt += mx(x,y);
        }

        cout<<cnt<<endl;
    }
}


Comments

Submit
0 Comments
More Questions

287A - IQ Test
1108A - Two distinct points
1064A - Make a triangle
1245C - Constanze's Machine
1005A - Tanya and Stairways
1663F - In Every Generation
1108B - Divisors of Two Integers
1175A - From Hero to Zero
1141A - Game 23
1401B - Ternary Sequence
598A - Tricky Sum
519A - A and B and Chess
725B - Food on the Plane
154B - Colliders
127B - Canvas Frames
107B - Basketball Team
245A - System Administrator
698A - Vacations
1216B - Shooting
368B - Sereja and Suffixes
1665C - Tree Infection
1665D - GCD Guess
29A - Spit Problem
1097B - Petr and a Combination Lock
92A - Chips
1665B - Array Cloning Technique
1665A - GCD vs LCM
118D - Caesar's Legions
1598A - Computer Game
1605A - AM Deviation